A NOTE ON PACKING PATHS IN PLANAR GRAPHS ANDRÁS FRANK and ZOLTÁN SZIGETI
ثبت نشده
چکیده
P.D. Seymour proved that the cut criterion is necessary and sufficient for the solvability of the edgedisjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, M. Middendorf and F. Pfeiffer proved the problem to be NP-complete. For this case E. Korach and M. Penn proved that the cut criterion is sufficient for the existence of a near-complete packing of paths. Here we generalize this result by showing how a natural strengthening of the cut criterion yields better packings of paths. Analogously to Seymour’s approach, we actually prove a theorem on packing cuts in an arbitrary graph and then the planar edge-disjoint paths case is obtained by planar dualization. The main result is derived from a theorem of A. Sebő on the structure of ±1 weightings of a bipartite graph with no negative circuits.
منابع مشابه
A note on packing paths in planar graphs
P.D. Seymour proved that the cut criterion is necessary and suucient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, M. Middendorf and F. Pfeiier proved the problem to be NP-complete. For this case E. Korach and M. Penn proved that the cut criterion is suucient for the existen...
متن کاملOn packing spanning arborescences with matroid constraint
Let D = (V + s,A) be a digraph with a designated root vertex s. Edmonds’ seminal result [4] implies that D has a packing of k spanning s-arborescences if and only if D has a packing of k (s, t)-paths for all t ∈ V , where a packing means arc-disjoint subgraphs. Let M be a matroid on the set of arcs leaving s. A packing of (s, t)-paths is called M-based if their arcs leaving s form a base of M w...
متن کاملSimple Algorithms for Steiner Trees and Paths Packing Problems in Planar Graphs
In this paper we give a short survey on eecient algorithms for Steiner trees and paths packing problems in planar graphs. We particularly concentrate on recent results. The rst result is a linear-time algorithm for packing vertex-disjoint trees resp. paths within a planar graph, where the vertices to be connected lie on at most two diierent faces 26, 32]. This algorithm is based on a linear-tim...
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملOn a min-max theorem on bipartite graphs
Frank, Sebő and Tardos [4] proved that for any connected bipartite graft (G, T ), the minimum size of a T-join is equal to the maximum value of a partition of A, where A is one of the two colour classes of G. Their proof consists of constructing a partition of A of value |F |, by using a minimum T-join F. That proof depends heavily on the properties of distances in graphs with conservative weig...
متن کامل